A Parallel Matrix-Based Approach for Computing Approximations in Dominance-Based Rough Sets Approach
نویسندگان
چکیده
Dominance-based Rough Sets Approach (DRSA) is a useful tool for multi-criteria classification problems solving. Parallel computing is an efficient way to accelerate problems solving. Computation of approximations is a vital step to find the solutions with rough sets methodologies. In this paper, we propose a matrix-based approach for computing approximations in DRSAand design the corresponding parallel algorithms on Graphics Processing Unit (GPU). A numerical example is employed to illustrate the feasibility of the matrix-based approach. Experimental evaluations show the performance of the parallel algorithm.
منابع مشابه
Matrix Method for Computing Approximations in Variable Consistency Dominance-Based Rough Set Approach
Lower and upper approximations of upward (downward) union of decision classes in Variable Consistency Dominance-Based Rough Set Approach (VC-DRSA) are the basis for extraction of decision rules, so computations of approximations is a necessary step in knowledge representing and reduction based on VCDRSA. In this paper, a matrix-based method for computing lower approximations of upward and downw...
متن کاملComputing Approximations of Dominance-Based Rough Sets by Bit-Vector Encodings
This paper introduces a mechanism for computing approximations of Dominance-Based Rough Sets (DBRS) by bit-vector encodings. DBRS was introduced by Greco et al. as an extension of Pawlak’s classical rough sets theory by using dominance relations in place of equivalence relations for approximating sets of preference ordered decision classes. Our formulation of dominance-based approximation space...
متن کاملIncremental updating approximations in dominance-based rough sets approach under the variation of the attribute set
Dominance-based Rough Sets Approach (DRSA) is a generalized model of the classical Rough Sets Theory (RST) which may handle information with preference-ordered attribute domain. The attribute set in the information system may evolve over time. Approximations of DRSA used to induce decision rules need updating for knowledge discovery and other related tasks. We firstly introduce a kind of domina...
متن کاملIncremental approximation computation in incomplete ordered decision systems
Approximation computation is a critical step in rough sets theory used in knowledge discovery and other related tasks. In practical applications, an information system often evolves over time by the variation of attributes or objects. Effectively computing approximations is vital in data mining. Dominance-based rough set approach can handle information with preference-ordered attribute domain, ...
متن کاملVariable Consistency Model of Dominance-Based Rough Sets Approach
Consideration of preference-orders requires the use of an extended rough set model called Dominance-based Rough Set Approach (DRSA). The rough approximations defined within DRSA are based on consistency in the sense of dominance principle. It requires that objects having not-worse evaluation with respect to a set of considered criteria than a referent object cannot be assigned to a worse class ...
متن کامل